Union-Intersecting Set Systems
نویسندگان
چکیده
منابع مشابه
Union-Intersecting Set Systems
Three intersection theorems are proved. First, we determine the size of the largest set system, where the system of the pairwise unions is l-intersecting. Then we investigate set systems where the union of any s sets intersect the union of any t sets. The maximal size of such a set system is determined exactly if s + t ≤ 4, and asymptotically if s + t ≥ 5. Finally, we exactly determine the maxi...
متن کاملIntersecting set systems and graphic matroids,
Two simple proofs are given to an earlier partial result about an extremal set theoretic conjecture of Chung, Frank!, Graham, Shearer and Faudree, Schelp, S6s, respectively. The statement is slightly strengthened within a matroid theoretic framework. The first proof re lies on results from matroid theory, while the second is based on an explicit constJuction providing an elementary proof. @ 199...
متن کاملSet systems with union and intersection constraints
Let 2 ≤ d ≤ k be fixed and n be sufficiently large. Suppose that G is a collection of k-element subsets of an n-element set, and |G| > ( n−1 k−1 ) . Then G contains d sets with union of size at most 2k and empty intersection. This verifies a conjecture of the first author for large n.
متن کاملIntersecting Systems
An intersecting system of type (∃,∀, k, n) is a collection F = {F1, . . . ,Fm} pf pairwise disjoint families of k–subsets of an n–element set satisfying the following condition. For every ordered pair Fi and Fj of distinct members of F there exists an A ∈ Fi that intersects every B ∈ Fj . Let In(∃,∀, k) denote the maximum possible cardinality of an intersecting system of type (∃,∀, n). Ahlswede...
متن کاملSet systems with no union of cardinality 0 modulom
Let q be a prime power. It is shown that for any hypergraph ~,~ = {F~,..., Fdtq_~)+~ } whose maximal degree is d, there exists Z ¢ ~o c ~, such that IUF~oFI =-0 (rood q). For integers d, m __ 1 let fe(m) denote the minimal t such that for any hypergraph -~ = {Fz . . . . . Ft} whose maximal degree is d, there exists ~ ¢ o~ o c Y, such that I~F~ ~oFI -= 0 (mod m). Here we determine fd(m) when m i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2014
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-014-1456-7